Deep Semantics for Dependency Structures
نویسندگان
چکیده
Although dependency parsers have become increasingly popular, little work has been done on how to associate dependency structures with deep semantic representations. In this paper, we propose a semantic calculus for dependency structures which can be used to construct deep semantic representations from joint syntactic and semantic dependency structures similar to those used in the ConLL 2008 Shared Task.
منابع مشابه
Extracting Noun Phrases in Subject and Object Roles for Exploring Text Semantics
In tune with the recent developments in the automatic retrieval of text semantics, this paper is an attempt to extract one of the most fundamental semantic units from natural language text. The context is intuitively extracted from typed dependency structures basically depicting dependency relations instead of Part-Of-Speech tagged representation of the text. The dependency relations imply deep...
متن کاملParDeepBank: Multiple Parallel Deep Treebanking
This paper describes the creation of an innovative and highly parallel treebank of three languages from different language groups — English, Portuguese and Bulgarian. The linguistic analyses for the three languages are done by compatible parallel automatic HPSG grammars using the same formalism, tools and implementation strategy. The final analysis for each sentence in each language consists of...
متن کاملTowards a Syntax-Semantics Interface for Topological Dependency Grammar
We present the first step towards a constraint-based syntax-semantics interface for Topological Dependency Grammar (TDG) (Duchier and Debusmann, 2001). We extend TDG with a new level of representation called semantic dependency dag to capture the deep semantic dependencies and clearly separate this level from the syntactic dependency tree. We stipulate an emancipation mechanism between these le...
متن کاملA Data-Driven, Factorization Parser for CCG Dependency Structures
This paper is concerned with building CCG-grounded, semantics-oriented deep dependency structures with a data-driven, factorization model. Three types of factorization together with different higherorder features are designed to capture different syntacto-semantic properties of functor-argument dependencies. Integrating heterogeneous factorizations results in intractability in decoding. We prop...
متن کاملResources for building applications with Dependency Minimal Recursion Semantics
We describe resources aimed at increasing the usability of the semantic representations utilized within the DELPH-IN (Deep Linguistic Processing with HPSG) consortium. We concentrate in particular on the Dependency Minimal Recursion Semantics (DMRS) formalism, a graph-based representation designed for compositional semantic representation with deep grammars. Our main focus is on English, and sp...
متن کامل